l = input().split()
n, k = int(l[0]), int(l[1])
arr = [int(x) for x in input().split()]
s = [0] * n
for i in range(n):
s[i] = arr[i] if i == 0 else arr[i] + s[i-1]
ans = -1
min_s = float('inf')
for i in range(k-1, n):
v = 0 if i - k < 0 else s[i-k]
if s[i] - v < min_s:
min_s = s[i] - v
ans = i-k+2
print(ans)#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
using namespace std;
int arr[200005];
int main() {
fast;
ll n,k,idx,sum,temp,t,l;
cin>>n>>k;
vector<ll>v;
ll x;cin>>x;
v.push_back(x);
for (int i = 1; i <n ; ++i) {
cin>>x;
v.push_back(v[i-1]+x);
}
t=l=k;
l-=1;
sum=v[l];
idx=l;
for (ll i = t; i < n; ++i) {
temp=v[i]-v[i-k];
if(temp<sum){
sum=temp;
idx=i;
}
}
idx-=k;
idx+=1;
cout<<idx+1<<"\n";
}287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |